III.--SYMBOLICAL REASONING
نویسندگان
چکیده
منابع مشابه
Information decomposition of symbolical sequences
Earlier comprehensive mathematical methods were developed for the study of periodicity of continuous and discrete numerical sequences, using Fourier transformation and allowing the definition of the spectral density of a numerical sequence. However, such an application of a Fourier transform demands presentation of a symbolic sequence as a numerical sequence in which the properties of any symbo...
متن کاملON SYMBOLICAL GEOMETRY By
Various errata noted by Hamilton have been corrected. In addition, the following obvious corrections have been made:— in article 13, the sentence before equation (103), the word 'considered' has been changed to 'considering'; a missing comma has been inserted in equation (172); in equation (209), '= 0' has been added; in article 31, the sentence after equation (227), d has been corrected to d ;...
متن کاملSymbolical Kernel-Based Reasoning: Its Application to the Rule Extraction in Dictyostelium discoideum DNA
Kernel-based method is one of the promising algorithms in the pattern recognition field [1]. We have extended the algorithm to the symbolical reasoning tasks (we call the algorithm symbolical kernel-based reasoning (SKBR)) [2], and we currently apply the SKBR to the rule extraction in Dictyostelium discoideum the DNA and cDNA databases of which are well established already [3]. Goal of our proj...
متن کاملA Symbolical Approach to Negative Numbers
Recent Early Algebra research indicates that it is better to teach negative numbers symbolically, as uncompleted subtractions or “difference pairs”, an idea due to Hamilton, rather than abstractly as they are currently taught, since all the properties of negative numbers then follow from properties of the subtraction operation with which children are already familiar. Symbolical algebra peaked ...
متن کاملGoing Polymorphic - TH1 Reasoning for Leo-III
While interactive proof assistants for higher-order logic (HOL) commonly admit reasoning within rich type systems, current theorem provers for HOL are mainly based on simply typed λ-calculi and therefore do not allow such flexibility. In this paper, we present modifications to the higher-order automated theorem prover Leo-III for turning it into a reasoning system for rank-1 polymorphic HOL. To...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mind
سال: 1880
ISSN: 0026-4423,1460-2113
DOI: 10.1093/mind/os-v.17.45